Tail Asymptotics for the Queue Size Distribution in an M/G/1 Retrial Queue
نویسندگان
چکیده
منابع مشابه
Tail asymptotics for the queue length in an M/G/1 retrial queue
In this paper, we study the tail behavior of the stationary queue length of an M/G/1 retrial queue. We show that the subexponential tail of the stationary queue length of an M/G/1 retrial queue is determined by that of the corresponding M/G/1 queue, and hence the stationary queue length in an M/G/1 retrial queue is subexponential if the stationary queue length in the corresponding M/G/1 queue i...
متن کاملTail Asymptotics for the Waiting Time in an M/g/1 Retrial Queue
We consider an M/G/1 retrial queue, where the service time distribution has a regularly varying tail with index −β, 1 < β < 2. It is shown that the waiting time distribution has a regularly varying tail with index 1− β, and the pre-factor is determined explicitly. The result is obtained by comparing the waiting time in the M/G/1 retrial queue with the waiting time in the ordinary M/G/1 queue wi...
متن کاملSojourn time asymptotics in the MG1 processor sharing queue
We show for the M/G/1 processor sharing queue that the service time distribution is regularly varying of index −ν, ν non-integer, iff the sojourn time distribution is regularly varying of index −ν. This result is derived from a new expression for the Laplace–Stieltjes transform of the sojourn time distribution. That expression also leads to other new properties for the sojourn time distribution...
متن کاملOn the Queue Tail Asymptotics for General Multifractal Traffic
The tail asymptotics in an infinite capacity single server queue serviced at a constant rate and driven by general multifractal input process is presented. It has been shown that in the important subcase of the monofractal Fractional Brownian Motion (FBM) input traffic our result gives the well-known Weibullian tail. Practical engineering applications and validation of the results based on the ...
متن کاملStationary tail asymptotics of a tandem queue with feedback
Motivated by applications in computer networks, in this talk, we consider a tandem queue with feedback.In this model, both the interarrival time and the service time are exponential. Upon completion of the service at thesecond station, the customer either leaves the system with probability p or goes back together with all customersin the second queue to the first queue with probabil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2007
ISSN: 0021-9002,1475-6072
DOI: 10.1017/s0021900200003788